Reordering computations for parallel execution
نویسندگان
چکیده
منابع مشابه
Plan Reordering and Parallel Execution - A Parameterized Complexity View
We reconsider the optimization problems for partial-order and parallel plans previously studied by Bäckström (JAIR, 1998), but use parameterized complexity to get a more fine-grained picture. Problems we study include the following: I Can we deorder/reorder the actions of a plan optimally? I What is the optimal parallel execution length of a plan? Plan reordering: to change the order of actions...
متن کاملEdgePack: A Parallel Vertex and Node Reordering Package for Optimizing Edge-Based Computations in Unstructured Grids
A new and simple methodology is proposed to choose the best data layout for codes using iterative solvers in unstructured grid problems. This methodology is realized as a suite of routines named EdgePack, acting during pre-solution and solution phases, based on data locality optimization techniques and variations of the matrix-vector product algorithm. Results have been demonstrating the great ...
متن کاملOptimal Reordering and Mapping of a Class of Nested-Loops for Parallel Execution
This paper addresses the compile-time optimization of a class of nested-loop computations that arise in some computational physics applications. The computations involve summations over products of array terms in order to compute multi-dimensional surface and volume integrals. Reordering additions and multiplications and applying the distributive law can significantly reduce the number of opera...
متن کاملReordering Query Execution in Tertiary Memory Databases
In the relational model the order of fetching data does not a ect query correctness. This exibility is exploited in query optimization by statically reordering data accesses. However, once a query is optimized, it is executed in a xed order in most systems, with the result that data requests are made in a xed order. Only limited forms of runtime reordering can be provided by low-level device ma...
متن کاملConsh: Confined Execution Environment for Internet Computations
The recent rapid growth of the Internet made a vast pool of resources available globally and enabled new kinds of applications raising the need for transparent remote access and for protected computing. Currently users need specialized software such as web browsers or FTP clients to access global resources. It is desirable to instead provide OS support for transparent access to these resources ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Applied Numerical Methods
سال: 1986
ISSN: 0748-8025,1555-2047
DOI: 10.1002/cnm.1630020307